NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
951	GPS: A Graph Processing System⇤ Semih Salihoglu and Jennifer Widom Stanford University {semih,widom}@cs.stanford.edu Abstract Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2013-06-18 18:35:13 NP-complete problems Graph partition Graph Connected component Graph coloring Edge coloring Graph theory Theoretical computer science Mathematics
952	0 DISCRETli MATHEMATICS5[removed]North-Holland Publishing Company ACYCLIC ORIENTATIONS OF GRAPHS* Richard P. STANLEY Departmentof Mathematics,Universityof California, Add to Reading List Source URL: www-math.mit.edu Language: English - Date: 2007-08-09 20:43:14 Graph coloring NP-complete problems Chromatic polynomial Polynomials Directed acyclic graph Directed graph Graph Tutte polynomial Covering graph Graph theory Mathematics Theoretical computer science
953	Math. Program., Ser. A DOI[removed]s10107[removed]FULL LENGTH PAPER On linear and semidefinite programming relaxations for hypergraph matching Add to Reading List Source URL: www.cse.cuhk.edu.hk Language: English - Date: 2011-08-15 06:07:56 Operations research NP-complete problems Linear programming Combinatorial optimization Mathematical optimization Vertex cover Linear programming relaxation Hypergraph Relaxation Mathematics Theoretical computer science Applied mathematics
954	Local Search: Is Brute-Force Avoidable? Add to Reading List Source URL: ijcai.org Language: English - Date: 2009-06-22 08:17:00 Planar graphs NP-complete problems Tree decomposition Minor Apex graph Graph Clique-sum Neighbourhood Vertex cover Graph theory Theoretical computer science Graph operations
955	The Number of Hamiltonian Paths in a Rectangular Grid Karen L. Collins Lucia B. Krompart Add to Reading List Source URL: kcollins.web.wesleyan.edu Language: English - Date: 2000-08-14 13:08:30 NP-complete problems Hamiltonian path Inverse function Big O notation Mathematics Theoretical computer science Mathematical analysis
956	Approximation Algorithms for Correlated Knaspacks and Non-Martingale Bandits Anupam Gupta∗ Ravishankar Krishnaswamy∗ Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-02-14 10:17:58 Operations research Stochastic processes Dynamic programming Combinatorial optimization NP-complete problems Knapsack problem Multi-armed bandit Martingale Randomized rounding Statistics Theoretical computer science Applied mathematics
957	Separability and Topology Control of Quasi Unit Disk Graphs Jianer Chen∗, Anxiao(Andrew) Jiang∗, Iyad A. Kanj† , Ge Xia‡ , and Fenghui Zhang∗ ∗ Dept. of Computer Science, Texas A&M Univ. College Station, TX Add to Reading List Source URL: www.cs.lafayette.edu Language: English - Date: 2006-11-14 14:35:41 Tree Graph Vertex Planar graph Connectivity Induced path Planar separator theorem Path decomposition Graph theory Graph operations NP-complete problems
958	The x-and-y-axes travelling salesman problem Eranda C ¸ ela∗ Vladimir Deineko†‡ Add to Reading List Source URL: www.opt.math.tu-graz.ac.at Language: English - Date: 2012-08-17 06:11:47 NP-complete problems Operations research Elementary mathematics Travelling salesman problem Computational complexity theory Analytic geometry Combinatorial optimization Distance Cartesian coordinate system Mathematics Theoretical computer science Applied mathematics
959	Sparse Matrix Partitioning for Parallel Eigenanalysis of Large Static and Dynamic Graphs Add to Reading List Source URL: www.ieee-hpec.org Language: English - Date: 2014-08-25 20:44:10 Graph partition Graph Hypergraph Adjacency matrix Topology Line graph Graph theory Mathematics NP-complete problems
960	Exact Algorithms and Fixed-Parameter Tractability Summary of Dagstuhl Seminar[removed]July–29. July 2005 Rod Downey 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2006-01-19 05:18:59 NP-complete problems Analysis of algorithms Matroid theory Parameterized complexity Complexity classes Clique problem Vertex cover Time complexity Matroid Theoretical computer science Computational complexity theory Mathematics

UPDATE